Interleaving Sequences to Maximize the Minimum Preex Sum Interleaving Sequences to Maximize the Minimum Preex Sum
نویسنده
چکیده
We consider the problem of interleaving sequences of real numbers in order to maximize the minimum, over all preexes p of the interleaved sequence, of the sum of the numbers in p. A simple and eecient solution is given. This problem is motivated by a resource scheduling application, and a special case of the scheduling problem is reduced to the interleaving problem.
منابع مشابه
Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملFrom Algorithm Parallelism to Instruction-level Parallelism: an Encode-decode Chain Using Preex-sum (extended Abstract)
A novel comprehensive and coherent approach for the purpose of increasing instruction-level parallelism (ILP) is devised. The key new tool in our envisioned system update is the addition of a parallel preex-sum (PS) instruction , which will have eecient implementation in hardware, to the instruction-set architecture. This addition gives for the rst time a concrete way for recruiting the whole k...
متن کاملSequence Matters, But How Exactly? A Method for Evaluating Activity Sequences from Data
How should a wide variety of educational activities be sequenced to maximize student learning? Although some experimental studies have addressed this question, educational data mining methods may be able to evaluate a wider range of possibilities and better handle many simultaneous sequencing constraints. We introduce Sequencing Constraint Violation Analysis (SCOVA): a general method for evalua...
متن کاملParallel Maximum Sum Algorithms on Interconnection Networks
We develop parallel algorithms for both one-dimensional and two-dimensional versions of the maximum sum problem (or max sum for short) on several interconnection networks. These algorithms are all based on a simple scheme that uses preex sums. To this end, we rst show how to compute preex sums of N elements on a hypercube, a star, and a pancake interconnection network of size p (where p N) in o...
متن کاملA Sub-threshold 9T SRAM Cell with High Write and Read ability with Bit Interleaving Capability
This paper proposes a new sub-threshold low power 9T static random-access memory (SRAM) cell compatible with bit interleaving structure in which the effective sizing adjustment of access transistors in write mode is provided by isolating writing and reading paths. In the proposed cell, we consider a weak inverter to make better write mode operation. Moreover applying boosted word line feature ...
متن کامل